On ac-number quantum ?-function
نویسندگان
چکیده
منابع مشابه
compactifications and function spaces on weighted semigruops
chapter one is devoted to a moderate discussion on preliminaries, according to our requirements. chapter two which is based on our work in (24) is devoted introducting weighted semigroups (s, w), and studying some famous function spaces on them, especially the relations between go (s, w) and other function speces are invesigated. in fact this chapter is a complement to (32). one of the main fea...
15 صفحه اولac-driven atomic quantum motor.
We propose an ac-driven quantum motor consisting of two different, interacting ultracold atoms placed into a ring-shaped optical lattice and submerged in a pulsating magnetic field. While the first atom carries a current, the second one serves as a quantum starter. For fixed zero-momentum initial conditions the asymptotic carrier velocity converges to a unique nonzero value. We also demonstrate...
متن کاملQuantum router based on ac control of qubit chains
We study the routing of quantum information in qubit chains. This task is achieved by suitably chosen time-dependent local fields acting on the qubits. Employing the physics of coherent destruction of tunneling, we demonstrate that a driving-induced renormalization of the coupling between neighboring qubits provides the key for controlling the transduction of quantum information between permane...
متن کاملAdiabatic response and quantum thermoelectrics for ac-driven quantum systems
Marı́a Florencia Ludovico,1,2 Francesca Battista,1,2 Felix von Oppen,3 and Liliana Arrachea1,2 1Departamento de Fı́sica, FCEyN, Universidad de Buenos Aires and IFIBA, Pabellón I, Ciudad Universitaria, 1428 CABA, Argentina 2International Center for Advanced Studies, UNSAM, Campus Miguelete, 25 de Mayo y Francia, 1650 Buenos Aires, Argentina 3Dahlem Center for Complex Quantum Systems and Fachbereic...
متن کاملThe Quantum Query Complexity of Ac
We show that any quantum algorithm deciding whether an input function f from [n] to [n] is 2-to-1 or almost 2-to-1 requires Θ(n) queries to f . The same lower bound holds for determining whether or not a function f from [2n − 2] to [n] is surjective. These results yield a nearly linear Ω(n/ logn) lower bound on the quantum query complexity of AC0. The best previous lower bound known for any AC0...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical and Mathematical Physics
سال: 1994
ISSN: 0040-5779,1573-9333
DOI: 10.1007/bf01017328